Cyclic code from the first class Whiteman's generalized cyclotomic sequence with order 4

نویسندگان

  • Yuhua Sun
  • Tongjiang Yan
  • Hui Li
چکیده

Generalized cyclotomic sequences of period pq have several desirable randomness properties if the two primes p and q are chosen properly. In particular, Ding deduced the exact formulas for the autocorrelation and the linear complexity of these sequences of order 2. In this paper, we consider the generalized sequences of order 4. Under certain conditions, the linear complexity of these sequences of order 4 is developed over a finite field Fl. Results show that in many cases they have high linear complexity.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cyclic codes from the first class two-prime Whiteman's generalized cyclotomic sequence with order 6

Abstract. BinaryWhiteman’s cyclotomic sequences of orders 2 and 4 have a number of good randomness properties. In this paper, we compute the autocorrelation values and linear complexity of the first class two-prime Whiteman’s generalized cyclotomic sequence (WGCS-I) of order d = 6. Our results show that the autocorrelation values of this sequence is four-valued or five-valued if (n1−1)(n2−1)/36...

متن کامل

Autocorrelation values and Linear complexity of generalized cyclotomic sequence of order four, and construction of cyclic codes

Let n1 and n2 be two distinct primes with gcd(n1 − 1, n2 − 1) = 4. In this paper, we compute the autocorrelation values of generalized cyclotomic sequence of order 4. Our results show that this sequence can have very good autocorrelation property. We determine the linear complexity and minimal polynomial of the generalized cyclotomic sequence over GF(q) where q = pm and p is an odd prime. Our r...

متن کامل

Cyclic codes from two-prime generalized cyclotomic sequences of order 6

Cyclic codes have wide applications in data storage systems and communication systems. Employing two-prime Whiteman generalized cyclotomic sequences of order 6, we construct several classes of cyclic codes over the finite field GF(q) and give their generator polynomials. And we also calculate the minimum distance of some cyclic codes and give lower bounds of the minimum distance for some other ...

متن کامل

On the Linear Complexity of Generalized Cyclotomic Sequences of Order Four Over Zpq

Pseudorandom sequences with certain properties are widely used in simulation, software testing, ranging systems, global positioning systems, code-division multiple-access systems, radar systems, spread-spectrum communication systems, and especially in stream ciphers. The cyclotomic sequences [1] have a number of attractive randomness properties. In this letter we first describe generalized cycl...

متن کامل

The Linear Complexity of Whiteman’s Generalized Cyclotomic Sequences of Period

In this paper, we mainly get three results. First, let , be distinct primes with ; we give a method to compute the linear complexity of Whiteman’s generalized cyclotomic sequences of period . Second, if , we compute the exact linear complexity of Whiteman’s generalized cyclotomic sequences. Third, if , , and we fix a common primitive root of both and , then , which is a subgroup of the multipli...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1303.6378  شماره 

صفحات  -

تاریخ انتشار 2013